Set theory - PDFSEARCH.IO - Document Search Engine

Set theory
Results: 2815

#	Item
491	ON THE DEFINITION AND K-THEORY REALIZATION OF A MODULAR FUNCTOR IGOR KRIZ AND LUHANG LAI Abstract. We present a definition of a (super)-modular functor Add to Reading List Source URL: www.math.lsa.umich.edu Language: English - Date: 2014-10-16 18:16:03 Category theory Functors Algebraic topology Monoidal categories Nerve Enriched category Topological quantum field theory Sheaf Equivalence of categories Natural transformation Universal property Simplicial set
492	V22: Honors Theory of Computation Problem Set 5 Solutions Problem 1 Solution: Let ML be the Turing machine that recognizes L. This means that on every w ∈ L, ML accepts, and on every x 6∈ L, ML either reject Add to Reading List Source URL: ftp.cs.nyu.edu Language: English - Date: 2010-12-12 10:20:22
493	A Theory of Arrays with set and copy Operations∗ (Extended Abstract) Stephan Falke Carsten Sinz Add to Reading List Source URL: smt2012.loria.fr Language: English - Date: 2012-06-20 03:34:17
494	Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2014-06-25 03:14:23 Computational complexity theory Theory of computation Complexity classes Packing problems NP-complete problems Bin packing problem Approximation algorithms Polynomial-time approximation scheme Partition problem NP NC Time complexity
495	Accounting for similarities in destination choice modelling: A concept Nadine Schüssler Kay W. Axhausen STRC 2009 Add to Reading List Source URL: www.strc.ch Language: English - Date: 2009-09-16 14:45:36 Choice modelling Transportation planning Statistical models Decision theory Discrete choice Mode choice Mixed logit Choice set Trip distribution Scientific modelling Choice Decision-making
496	Honors Theory of Computation Problem Set 2 Solutions Problem 1 Solution: (a) Suppose that L1 = {0n 1m 0n } is regular. Let p be the pumping length given by the pumping Add to Reading List Source URL: ftp.cs.nyu.edu Language: English - Date: 2010-10-23 16:40:50
497	CSCI-UA: Theory of Computation Problem Set 4 All problems are worth 10 points. Collaboration is allowed, but you must write your own solutions. Write the names of your collaborators (and your own!). Unless state Add to Reading List Source URL: ftp.cs.nyu.edu Language: English - Date: 2013-11-05 11:00:26
498	Advances in gringo series 3 Martin Gebser, Roland Kaminski, Arne K¨onig, and Torsten Schaub? Institut f¨ur Informatik, Universit¨at Potsdam Abstract. We describe the major new features emerging from a significant rede Add to Reading List Source URL: www.cs.uni-potsdam.de Language: English - Date: 2011-04-05 15:02:45 Model theory Quantification Answer set programming Logic programming FO Functional predicate Universal quantification Limit of a function Expected value Predicate
499	Seminar on ‘Motivic Donaldson–Thomas invariants’1 Content. In the summer term 2009 we will set out to read the recent paper [KS] by Kontsevich and Soibelman. The seminar will be a natural sequel to last term’s s Add to Reading List Source URL: www.math.uni-bonn.de Language: English - Date: 2009-04-02 00:55:56 Algebraic geometry Homological algebra String theory Fellows of the Royal Society Wall-crossing DonaldsonThomas theory Motive Algebra Yan Soibelman Triangulated category Bernhard Keller Richard Thomas
500	NetworkX Reference ReleaseAric Hagberg, Dan Schult, Pieter Swart September 20, 2014 Add to Reading List Source URL: networkx.github.io Language: English - Date: 2016-03-06 02:10:20 Graph theory NetworkX Graph Line graph DOT Directed graph Multigraph Clique Independent set Sparksee Connectivity Degree

UPDATE